Approximation Algorithms for the (S,T)-Connectivity Problems
نویسندگان
چکیده
We study a directed network design problem called the k-(S, T )-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer k, the minimum cost k-vertex connected spanning subgraph problem is a special case of the k(S, T )-connectivity problem. We defer precise statements of the problem and of our results to the introduction. For k = 1, we call the problem the (S, T )-connectivity problem. We study three variants of the problem: the standard (S, T )-connectivity problem, the relaxed (S, T )-connectivity problem, and the unrestricted (S, T )-connectivity problem. We give hardness results for these three variants. We design a 2-approximation algorithm for the standard (S, T )-connectivity problem. We design tight approximation algorithms for the relaxed (S, T )-connectivity problem and one of its special cases. For any k, we give an O(log k log n)-approximation algorithm, where n denotes the number of vertices. The approximation guarantee almost matches the best approximation guarantee known for the minimum cost k-vertex connected spanning subgraph problem which is O(log k log n n−k ) due to Nutov in 2009 [62].
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملIterative algorithms for families of variational inequalities fixed points and equilibrium problems
متن کامل
Minimum Tenacity of Toroidal graphs
The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph's connec...
متن کاملApproximation algorithms for minimum-cost k-(S, T ) connected digraphs
We introduce a model for NP-hard problems pertaining to the connectivity of graphs, and design approximation algorithms for some of the key problems in this model. One of the well-known NP-hard problems is to find a minimum-cost strongly connected spanning subgraph of a directed network. In the minimum-cost k-(S, T ) connected digraph (abbreviated, k-(S, T ) connectivity) problem we are given a...
متن کاملChain hexagonal cacti: extremal with respect to the eccentric connectivity index
In this paper we present explicit formulas for the eccentric connectivity index of three classes of chain hexagonal cacti. Further, it is shown that the extremal chain hexagonal cacti with respect to the eccentric connectivity index belong to one of the considered types. Some open problems and possible directions of further research are mentioned in the concluding section.
متن کامل